Addendum to “Optimising the Linda in primitive: Understanding tuple-space run-times" presented at SAC’2000
نویسنده
چکیده
Let us assume that these two agents are accessing the same tuple space, and that no other agents are able to access the tuple space, and that the tuple space contains two tuples, a and b. The case graph for these agents is shown in Figure 1. As can be seen, there is no case where both Agent A and B complete, either one or both block waiting for a matching A1:in(a) A2:rd(b) B1:in(b) B2:rd(a) B1:in(b) A1:in(a) B1:in(b) A1:in(a) B blocked A & B blocked A blocked
منابع مشابه
Proving the correctness of optimising destructiveand non - destructive reads over tuple
In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a diierent process. T...
متن کاملProving the correctness of optimising destructiveand non - destructive reads over tuple spacesRocco
In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a diierent process. T...
متن کاملProving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces
In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a di erent process. T...
متن کاملBulk primitives in Linda run-time systems
This thesis investigates techniques for the efficient implementation of the Linda parallel process coordination model for open, distributed computing systems. The principal focus of the research is on the use of the bulk movement of tuples within open systems which, contrary to intuition, can result in significant efficiency gains for a large class of problems. The emphasis on open systems — th...
متن کاملCombining Timed Coordination Primitives and Probabilistic Tuple Spaces
In this paper we present an integration of PLinda, a probabilistic extension of Linda, and StoKlaim, a stochastic extension of KLAIM. In the resulting language, StoPKlaim, the execution time of coordination primitives is modeled by means of exponentially distributed random variables, as in StoKlaim, the choice of the primitive to be executed among conflicting ones is thus resolved by the race c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007